Large components of bipartite random mappings
نویسندگان
چکیده
A bipartite random mapping TK,L of a finite set V = V1 ∪ V2, |V1| = K and |V2| = L , into itself assigns independently to each i ∈ V1 its unique image j ∈ V2 with probability 1/L and to each i ∈ V2 its unique image j ∈ V1 with probability 1/K . We study the connected component structure of a random digraph G(TK,L) , representing TK,L, as K → ∞ and L → ∞. We show that, no matter how K and L tend to infinity relative to each other, the joint distribution of the normalized order statistics for the component sizes converges in distribution to the Poisson-Dirichlet distribution on the simplex ∇ = {{xi} : ∑ xi ≤ 1, xi ≥ xi+1 ≥ 0 for every i ≥ 1}.
منابع مشابه
Transliteration Mining Using Large Training and Test Sets
Much previous work on Transliteration Mining (TM) was conducted on short parallel snippets using limited training data, and successful methods tended to favor recall. For such methods, increasing training data may impact precision and application on large comparable texts may impact precision and recall. We adapt a state-of-the-art TM technique with the best reported scores on the ACL 2010 NEWS...
متن کاملConvergence and Stability of Modified Random SP-Iteration for A Generalized Asymptotically Quasi-Nonexpansive Mappings
The purpose of this paper is to study the convergence and the almost sure T-stability of the modied SP-type random iterative algorithm in a separable Banach spaces. The Bochner in-tegrability of andom xed points of this kind of random operators, the convergence and the almost sure T-stability for this kind of generalized asymptotically quasi-nonexpansive random mappings are obtained. Our result...
متن کاملRandom fixed point of Meir-Keeler contraction mappings and its application
In this paper we introduce a generalization of Meir-Keeler contraction forrandom mapping T : Ω×C → C, where C be a nonempty subset of a Banachspace X and (Ω,Σ) be a measurable space with being a sigma-algebra of sub-sets of. Also, we apply such type of random fixed point results to prove theexistence and unicity of a solution for an special random integral equation.
متن کاملWeak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees
We study the asymptotics of the p-mapping model of random mappings on [n] as n gets large, under a large class of asymptotic regimes for the underlying distribution p. We encode these random mappings in random walks which are shown to converge to a functional of the exploration process of inhomogeneous random trees, this exploration process being derived (Aldous-Miermont-Pitman 2004) from a bri...
متن کاملBlow-Up Lemma
The Regularity Lemma [16] is a powerful tool in Graph Theory and its applications. It basically says that every graph can be well approximated by the union of a constant number of random-looking bipartite graphs called regular pairs (see the definitions below). These bipartite graphs share many local properties with random bipartite graphs, e.g. most degrees are about the same, most pairs of ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 17 شماره
صفحات -
تاریخ انتشار 2000